By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 20, Issue 4, pp. 603-805

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Constructive Whitney–Graustein Theorem: Or How to Untangle Closed Planar Curves

Kurt Mehlhorn and Chee-Keng Yap

pp. 603-621

BibTeX  Abstract Full Text:  PDF

Reversal Complexity

Jianer Chen and Chee-Keng Yap

pp. 622-638

BibTeX  Abstract Full Text:  PDF

Computing the Strength of a Graph

Dan Gusfield

pp. 639-654

BibTeX  Abstract Full Text:  PDF

Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains

Andrew Chi-Chih Yao

pp. 655-668

BibTeX  Abstract Full Text:  PDF

Minimization of Rational Word Functions

Christophe Reutenauer and Marcel-Paul Schutzenberger

pp. 669-685

BibTeX  Abstract Full Text:  PDF

The Fast $m$-Transform: A Fast Computation of Cross-Correlations with Binary $m$-Sequences

Erich E. Sutter

pp. 686-694

BibTeX  Abstract Full Text:  PDF

On Counting Lattice Points in Polyhedra

Martin Dyer

pp. 695-707

BibTeX  Abstract Full Text:  PDF

Parallel Transitive Closure and Point Location in Planar Structures

Roberto Tamassia and Jeffrey S. Vitter

pp. 708-725

BibTeX  Abstract Full Text:  PDF

On Nonblocking Multirate Interconnection Networks

Shun-Ping Chung and Keith W. Ross

pp. 726-736

BibTeX  Abstract Full Text:  PDF

Intersecting Line Segments in Parallel with an Output-Sensitive Number of Processors

Michael T. Goodrich

pp. 737-755

BibTeX  Abstract Full Text:  PDF

Fast Parallel Arithmetic via Modular Representation

George I. Davida and Bruce Litow

pp. 756-765

BibTeX  Abstract Full Text:  PDF

Equality-Test and If-Then-Else Algebras: Axiomatization and Specification

Don Pigozzi

pp. 766-805

BibTeX  Abstract Full Text:  PDF